Solving Sudoku Puzzles Based on Customized Information Entropy
نویسندگان
چکیده
Conception and calculation method of information entropy is customized for Sudoku puzzles and a corresponding algorithm is designed to solve Sudoku puzzles. The definitions of inverse information entropy and information amount for inverse information entropy are also introduced and directly used instead of information entropy in order to simplify the solving procedure. Experimental results show that the algorithm has better time efficiency than available methods including generic algorithms and rule based algorithms and it can solve not only unique-solution puzzles (including extremely difficult puzzles) but also multiplesolution puzzles. It is concluded that information entropy can be used for grading Sudoku puzzles as well.
منابع مشابه
A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles
Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic ...
متن کاملHeuristic Reasoning on Graph and Game Complexity of Sudoku
The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this paper, we propose to focus on the essential graph structure underlying the Sudoku puzzle. First, we formalize Sudoku as a graph. Then a solving algorithm based on...
متن کاملSudokuBee: An Artificial Bee Colony-based Approach in Solving Sudoku puzzles
Sudoku is a popular newspaper puzzle that has become an international phenomenon. Sudoku which means “single digits” is a logicbased combinatorial puzzle with rules that are quite simple. Several algorithms have been used to solve this combinatorial optimization problem. This paper explores the possibility of using the Artificial Bee Colony (ABC) algorithm, a relatively new swarm-based optimiza...
متن کاملDifficulty Rating of Sudoku Puzzles: An Overview and Evaluation
How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on extensive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computational model of human solving activity. Using the model we show that there are two sources of the problem difficulty: complexity of...
متن کاملSudokuSat-A Tool for Analyzing Difficult Sudoku Puzzles
Sudoku puzzles enjoy world-wide popularity, and a large community of puzzlers is hoping for ever more difficult puzzles. A crucial step for generating difficult Sudoku puzzles is the fast assessment of the difficulty of a puzzle. In a study in 2006, it has been shown that SAT solving provides a way to efficiently differentiate between Sudoku puzzles according to their difficulty, by analyzing w...
متن کامل